DNAQL: a query language for DNA sticker complexes

DNA computing has a rich history of paradigms with great expressive power. However, far less power is needed for data manipulation. Indeed, the relational algebra, yardstick database systems, expressible in first-order logic, and thus powerful than Turing-complete models. models have to account many varied scenarios. A implementation manipulations might be nimbler perform its operation faster model. Hence, we propose restrictive model implementing manipulation operations, focused on implementability DNA. We call this sticker complex forte model, ability detect when hybridization becomes an uncontrolled chain reaction. Such reactions make predictable attractive deterministic computations. Next, define query language complexes, called DNAQL. DNAQL typed, applicative functional programming language, enough simulate algebra complexes. The type system enjoys number desirable properties such as soundness, maximality, tightness.